NIMCET Boolean algebra Previous Year Question Paper and Solution with PDF

Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations

NIMCET
Previous Year Questions

NIMCET
Previous Year Questions
NIMCET

NIMCET Previous Year Questions (PYQs)

NIMCET Boolean Algebra PYQ

Qus : 1NIMCET PYQ 2017

Which one of the following Boolean algebraic rule is correct?

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2017 PYQ

Solution

A + A'B = (A + A') . (A + B)

= 1 . (A + B)

= A + B

Qus : 2NIMCET PYQ 2017

Which term is redundant in the expression AB + A'C + BC ?

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2017 PYQ

Solution

Qus : 3NIMCET PYQ 2017

The total number binary function that can be defined using n Boolean variables is

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2017 PYQ

Solution

✅ Given Information:

We are asked to find the total number of binary functions that can be defined using n Boolean variables.

✅ Step 1: Number of input combinations:

For n Boolean variables, the number of possible input combinations is 2ⁿ.

✅ Step 2: Number of possible outputs:

Each input combination can map to either 0 or 1, so there are 2 possible outputs for each of the 2ⁿ input combinations.

✅ Final Formula:

Total Binary Functions = 2^(2ⁿ)

✅ Final Answer:

The total number of binary functions that can be defined using n Boolean variables is: 2^(2ⁿ)

Qus : 4NIMCET PYQ 2020

Assume x' represents negation of x the Boolean function x'y' + xy + x'y is equivalent to?

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2020 PYQ

Solution

Qus : 5NIMCET PYQ 2020

The equivalence of given expression x+x'y with Boolean theorem is….

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2020 PYQ

Solution

x+x'y

=(x+x')(x+y)

=(x+y)

Qus : 6NIMCET PYQ 2023

Consider the following minterm for F:F(P, Q, R, S) = Σ0, 2, 5, 7, 8, 10, 13, 15. The minterms 2, 7, 8, and 13 are don't care terms. The minimal sum of products form for F is

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2023 PYQ

Solution

Qus : 7NIMCET PYQ 2023

Cosider the following Boolean Expression for F:

$F(P,Q,R,S)=PQ+\overline{P}QR+\overline{P}Q\overline{R}S$ .

The minimum sum of products form of F is

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2023 PYQ

Solution

Qus : 8NIMCET PYQ 2023

The number of minterms in a

$n$ variable truth tableis

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2023 PYQ

Solution

✅ Number of Minterms in a n-variable Truth Table:

For n Boolean variables, the number of possible combinations of inputs is:

2ⁿ

Each combination corresponds to one minterm. Therefore, the total number of minterms in the truth table is also 2ⁿ.

✅ Final Answer:

The number of minterms in a n-variable truth table is: 2ⁿ

Qus : 9NIMCET PYQ 2023

Let

$\oplus$ and

$\odot$ denote the Exclusive - OR and Exclusive-NOR operations respectively. Which of the following is not correct?

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2023 PYQ

Solution

Qus : 10NIMCET PYQ 2023

The reduced form of the Boolean function F = xyz + xyz' + x'y'z + xy'z is

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2023 PYQ

Solution

Qus : 11NIMCET PYQ 2019

How many Boolean expressions can be be formed with 3 Boolean variables?

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2019 PYQ

Solution

Qus : 12NIMCET PYQ 2024

Any given truth table can be represented by

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2024 PYQ

Solution

Qus : 13NIMCET PYQ 2024

The expression P+QR is the reduced form of _____

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2024 PYQ

Solution

Boolean Simplification

Given Expression: P + QR

We ask: This is the simplified (reduced) form of which expression?

Try expanding: (P + Q)(P + R)

Using distributive law:

(P + Q)(P + R) = P(P + R) + Q(P + R) = P + PR + PQ + QR = P + PQ + PR + QR = P + QR (since P absorbs PQ and PR)

✅ Final Answer: (P + Q)(P + R)

Qus : 14NIMCET PYQ 2024

The Boolean expression for the following truth table is _________

x	y	x	f
0	0	0	0
0	0	1	0
0	1	0	1
0	1	1	0
1	0	0	0
1	0	1	1
1	1	0	0
1	1	1	1

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2024 PYQ

Solution

Qus : 15NIMCET PYQ 2022

The minimum number of NAND gates required for implementing the Boolean expression

$AB+A\, \overline{B}C+A\, \overline{B}\, \overline{C}$

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2022 PYQ

Solution

$AB+A\, \overline{B}C+A\, \overline{B}\, \overline{C}$

$AB+AB'C+AB'C'$

$AB+AB'(C+C')$

$AB+AB'$

$A(B+B')$

Qus : 16NIMCET PYQ 2022

Which of the following is equivalent to the Boolean expression:

$(X+Y).(X+\overline{Y}).(\overline{X}+Y)$

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2022 PYQ

Solution

$(X+Y).(X+\overline{Y}).(\overline{X}+Y)$

$(X+Y)(X+Y')(X'+Y)$

$(XX+XY+YX+YY')(X'+Y)$

$(X+XY)(X'+Y)$

$X(1+Y)(X'+Y)$

$X(X'+Y)$

$XX'+XY$

$XY$

Qus : 17NIMCET PYQ 2022

Write the simplified form of the Boolean expression

(A+C)(AD+AD')+AC+C

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2022 PYQ

Solution

(A+C)(AD+AD')+AC+C

=(A+C)A(D+D')+C(A+1)

=(A+C)+C

=A+C

Qus : 18NIMCET PYQ 2022

The Boolean expression AB+ AB' + A'C + AC is unaffected by the value of the Boolean variable

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2022 PYQ

Solution

$\begin{array}{ll}{A(B+\overline{B})+C(A+\overline{A})} \\ {A+C}\, \end{array}$

Qus : 19NIMCET PYQ 2022

If a signal passing through a gate is inhibited by sending a low into one of the inputs, and the output is HIGH, the gate is a(n):

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2022 PYQ

Solution

Output is high if any of the input is low. The truth table for NAND gate is:

A	B	Output
0	0	0
0	1	1
1	0	1
1	1	1

Table representing NAND Gate.

Qus : 20NIMCET PYQ 2016

The number of terms in the product of sums canonical form of

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2016 PYQ

Solution

Qus : 21NIMCET PYQ 2016

Consider the following min term expression for F.

F(P,Q,R,S) = ∑ (0, 2, 5, 7, 8, 10, 13, 15)

The minterms 2, 7, 8 and 13 are ‘do not care' terms.

The minimal sum of products form for F is

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2016 PYQ

Solution

Qus : 22NIMCET PYQ 2016

The Boolean expression represented by the following Venn diagram is

1
2
3
4
Go to Discussion

NIMCET Previous Year PYQNIMCET NIMCET 2016 PYQ

Solution

NIMCET

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

NIMCET

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Ask Your Question or Put Your Review.

Feedback

Info.

Information

Aspire's Library

NIMCET Previous Year Questions (PYQs)

NIMCET Boolean Algebra PYQ

Solution

Solution

Solution

✅ Given Information:

✅ Step 1: Number of input combinations:

✅ Step 2: Number of possible outputs:

✅ Final Formula:

✅ Final Answer:

Solution

Solution

Solution

Solution

Solution

✅ Number of Minterms in a n-variable Truth Table:

✅ Final Answer:

Solution

Solution

Solution

Solution

Solution

Boolean Simplification

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

Solution

NIMCET

NIMCET

Info.

Confirm Delete

Edit